Orie 633 Network Flows 1 Efficient Algorithms for Max Flow 1.1 Blocking Flow and Dinic's Algorithm
نویسندگان
چکیده
1 Efficient algorithms for max flow 1.1 Blocking flow and Dinic’s algorithm In this lecture, we’ll discuss about some other efficient algorithms for computing a maximum flow. They are based on the concept of a blocking flow. Definition 1 A flow f in G is blocking if every s-t path in G has some arc saturated. Every maximum flow is obviously also a blocking flow. Is every blocking flow a maximum flow? No, Figure 1 is a counterexample.
منابع مشابه
Maximum skew-symmetric flows and matchings
The maximum integer skew-symmetric flow problem (MSFP) generalizes both the maximum flow and maximum matching problems. It was introduced by Tutte [28] in terms of self-conjugate flows in antisymmetrical digraphs. He showed that for these objects there are natural analogs of classical theoretical results on usual network flows, such as the flow decomposition, augmenting path, and max-flow min-c...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملRecent Developments in Maximum Flow Algorithms
Goldberg and Rao recently proposed the blocking flow method based on a binary length function to obtain a better algorithm for the maximum flow problem. The previous algorithms based on the blocking flow method proposed by Dinic use the unit length function: every residual edge is of length 1. In this paper, we survey properties of the distance function defined by a length function and give an ...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملA Lower Bound on Computing Blocking Flows in Graphs
We show that the MAXIMUM BLOCKING FLOW problem on a graph of n vertices cannot be computed in time o(n1/4) with polynomially many processors on an unbounded fan-in PRAM without bit operations, even when the bitlengths of the inputs are restricted to be of size O(n2).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007